|
In linear algebra, an orthogonal matrix is a square matrix with real entries whose columns and rows are orthogonal unit vectors (i.e., orthonormal vectors), i.e. : where ''I'' is the identity matrix. This leads to the equivalent characterization: a matrix ''Q'' is orthogonal if its transpose is equal to its inverse: : An orthogonal matrix ''Q'' is necessarily invertible (with inverse ), unitary () and therefore normal () in the reals. The determinant of any orthogonal matrix is either +1 or −1. As a linear transformation, an orthogonal matrix preserves the dot product of vectors, and therefore acts as an isometry of Euclidean space, such as a rotation or reflection. In other words, it is a unitary transformation. The set of orthogonal matrices forms a group O(''n''), known as the orthogonal group. The subgroup SO(''n'') consisting of orthogonal matrices with determinant +1 is called the special orthogonal group, and each of its elements is a special orthogonal matrix. As a linear transformation, every special orthogonal matrix acts as a rotation. The complex analogue of an orthogonal matrix is a unitary matrix. ==Overview== An orthogonal matrix is the real specialization of a unitary matrix, and thus always a normal matrix. Although we consider only real matrices here, the definition can be used for matrices with entries from any field. However, orthogonal matrices arise naturally from dot products, and for matrices of complex numbers that leads instead to the unitary requirement. Orthogonal matrices preserve the dot product,〔("Paul's online math notes" ), Paul Dawkins, Lamar University, 2008. Theorem 3(c)〕 so, for vectors u, v in an ''n''-dimensional real Euclidean space : where ''Q'' is an orthogonal matrix. To see the inner product connection, consider a vector v in an ''n''-dimensional real Euclidean space. Written with respect to an orthonormal basis, the squared length of v is vTv. If a linear transformation, in matrix form ''Q''v, preserves vector lengths, then : Thus finite-dimensional linear isometries—rotations, reflections, and their combinations—produce orthogonal matrices. The converse is also true: orthogonal matrices imply orthogonal transformations. However, linear algebra includes orthogonal transformations between spaces which may be neither finite-dimensional nor of the same dimension, and these have no orthogonal matrix equivalent. Orthogonal matrices are important for a number of reasons, both theoretical and practical. The ''n''×''n'' orthogonal matrices form a group under matrix multiplication, the orthogonal group denoted by O(''n''), which—with its subgroups—is widely used in mathematics and the physical sciences. For example, the point group of a molecule is a subgroup of O(3). Because floating point versions of orthogonal matrices have advantageous properties, they are key to many algorithms in numerical linear algebra, such as QR decomposition. As another example, with appropriate normalization the discrete cosine transform (used in MP3 compression) is represented by an orthogonal matrix. 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「orthogonal matrix」の詳細全文を読む スポンサード リンク
|